On the Non-existence of Even Degree Graphs with Diameter 2 and Defect 2
نویسندگان
چکیده
Using eigenvalue analysis, it was shown by Erdös et al. that, with the exception of C4, there are no graphs of diameter 2, maximum degree d and d vertices. In this paper, we show that graphs of diameter 2, maximum degree d and d-1 vertices do not exist for most values of d, when d is even, and we conjecture that they do not exist for any even d greater than 4.
منابع مشابه
ct 2 01 0 On graphs of defect at most 2
In this paper we consider the degree/diameter problem, namely, given natural numbers ∆ ≥ 2 and D ≥ 1, find the maximum number N(∆,D) of vertices in a graph of maximum degree ∆ and diameter D. In this context, the Moore bound M(∆,D) represents an upper bound for N(∆,D). Graphs of maximum degree ∆, diameter D and order M(∆,D), called Moore graphs, turned out to be very rare. Therefore, it is very...
متن کاملOn bipartite graphs of diameter 3 and defect 2
We consider bipartite graphs of degree ∆ ≥ 2, diameter D = 3, and defect 2 (having 2 vertices less than the bipartite Moore bound). Such graphs are called bipartite (∆, 3,−2)-graphs. We prove the uniqueness of the known bipartite (3, 3,−2)-graph and bipartite (4, 3,−2)graph. We also prove several necessary conditions for the existence of bipartite (∆, 3,−2)graphs. The most general of these cond...
متن کاملNon-existence of bipartite graphs of diameter at least 4 and defect 2
The Moore bipartite bound represents an upper bound on the order of a bipartite graph of maximum degree ∆ and diameterD. Bipartite graphs of maximum degree ∆, diameterD and order equal to the Moore bipartite bound are called Moore bipartite graphs. Such bipartite graphs exist only if D = 2, 3, 4 and 6, and for D = 3, 4, 6, they have been constructed only for those values of ∆ such that ∆− 1 is ...
متن کاملOn bipartite graphs of defect 2
It is known that the Moore bipartite bound provides an upper bound on the order of a connected bipartite graph. In this paper we deal with bipartite graphs of maximum degree ∆ ≥ 2, diameter D ≥ 2 and defect 2 (having 2 vertices less than the Moore bipartite bound). We call such graphs bipartite (∆, D,−2)-graphs. We find that the eigenvalues other than ±∆ of such graphs are the roots of the poly...
متن کامل0 On bipartite graphs of defect at most 4 Ramiro
We consider the bipartite version of the degree/diameter problem, namely, given natural numbers ∆ ≥ 2 and D ≥ 2, find the maximum number Nb(∆,D) of vertices in a bipartite graph of maximum degree ∆ and diameter D. In this context, the Moore bipartite bound Mb(∆,D) represents an upper bound for Nb(∆,D). Bipartite graphs of maximum degree ∆, diameter D and order Mb(∆,D), called Moore bipartite gr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008